منابع مشابه
FUZZY LOGISTIC DIFFERENCE EQUATION
In this study, we consider two different inequivalent formulations of the logistic difference equation $x_{n+1}= beta x_n(1- x_n), n=0,1,..., $ where $x_n$ is a sequence of fuzzy numbers and $beta$ is a positive fuzzy number. The major contribution of this paper is to study the existence, uniqueness and global behavior of the solutions for two corresponding equations, using the concept of Huku...
متن کاملIndustrial Engineering Department Dokuz Eylül University Engineering Faculty İzmir, Turkey
The flange climb derailment is one of the cause of derailment for a typical switch. The derailment for the switch is a complex phenomenon since the contact area is changing dynamically. The contact angle between the wheel flange and the switch point is investegated in terms of the risk on the derailment. The contribution of this study is proving that UIC716R standard recommendation about the sw...
متن کاملHas Twenty-five Years of Empirical Software Engineering Made a Difference?
Our activities in software engineering typically fall into one of three categories, (1) to invent new phenomena, (2) to understand existing phenomena, and (3) to facilitate inspirational education. This paper explores the place of empirical software engineering in the first two of these activities. In this exploration evidence is drawn from the empirical literature in the areas of software insp...
متن کاملSplitting the Difference: The Historical Necessity of Synthesis in Software Engineering
For the last quarter of a century, software technologists have worked to address the “software crisis” identified in the 1960s. Their efforts have focused on a number of different areas, but have often been marked by the search for singular “best” solutions. However, the fundamental nature of software— involving basic and poorly understood problem-solving processes combined with unprecedented a...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS The Complexity of Maximizing the Difference of Two Matroid Rank Functions
In the context of discrete DC programming, Maehara and Murota (Mathematical Programming, Series A, 2014) posed the problem of determining the complexity of minimizing the difference of two M-convex set functions. In this paper, we show the NP-hardness of this minimization problem by proving a stronger result: maximizing the difference of two matroid rank functions is NP-hard. Maehara and Murota...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Feminist Media Histories
سال: 2018
ISSN: 2373-7492
DOI: 10.1525/fmh.2018.4.4.8